Local Convergence Properties of

نویسندگان

  • Nick Gould
  • A. Sartenaer
چکیده

We consider the local convergence properties of the class of augmented Lagrangian methods for solving nonlinear programming problems whose global convergence properties are analyzed by Conn et al. (1993a). In these methods, linear constraints are treated separately from more general constraints. These latter constraints are combined with the objective function in an augmented Lagrangian while the subproblem then consists of (approximately) minimizing this augmented Lagrangian subject to the linear constraints. The stopping rule that we consider for the inner iteration covers practical tests used in several existing packages for linearly constrained optimization. Our algorithmic class allows several distinct penalty parameters to be associated with diierent subsets of general equality constraints. In this paper, we analyze the local convergence of the sequence of iterates generated by this technique and prove fast linear convergence and boundedness of the potentially troublesome penalty parameters. Abstract. We consider the local convergence properties of the class of augmented Lagrangian methods for solving nonlinear programming problems whose global convergence properties are analyzed by Conn et al. (1993a). In these methods, linear constraints are treated separately from more general constraints. These latter constraints are combined with the objective function in an augmented Lagrangian while the subproblem then consists of (approximately) minimizing this augmented Lagrangian subject to the linear constraints. The stopping rule that we consider for the inner iteration covers practical tests used in several existing packages for linearly constrained optimization. Our algorithmic class allows several distinct penalty parameters to be associated with diierent subsets of general equality constraints. In this paper, we analyze the local convergence of the sequence of iterates generated by this technique and prove fast linear convergence and boundedness of the potentially troublesome penalty parameters.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some properties of band matrix and its application to the numerical solution one-dimensional Bratu's problem

A Class of new methods based on a septic non-polynomial spline function for the numerical solution one-dimensional Bratu's problem are presented. The local truncation errors and the methods of order 2th, 4th, 6th, 8th, 10th, and 12th, are obtained. The inverse of some band matrixes are obtained which are required in proving the convergence analysis of the presented method. Associated boundary f...

متن کامل

Uniform connectedness and uniform local connectedness for lattice-valued uniform convergence spaces

We apply Preuss' concept of $mbbe$-connectedness to the categories of lattice-valued uniform convergence spaces and of lattice-valued uniform spaces. A space is uniformly $mbbe$-connected if the only uniformly continuous mappings from the space to a space in the class $mbbe$ are the constant mappings. We develop the basic theory for $mbbe$-connected sets, including the product theorem. Furtherm...

متن کامل

Adaptive Decision Fusion in Detection Networks

In a detection&#10 network, the final decision is made by fusing the decisions from local detectors. The objective of that decision is to minimize the final error probability. To implement and optimal fusion rule, the performance of each detector, i.e. its probability of false alarm and its probability of missed detection as well as the a priori probabilities of the hypotheses, must be known. H...

متن کامل

Adaptive Decision Fusion in Detection Networks

In a detection network, the final decision is made by fusing the decisions from local detectors. The objective of that decision is to minimize the final error probability. To implement and optimal fusion rule, the performance of each detector, i.e. its probability of false alarm and its probability of missed detection as well as the a priori probabilities of the hypotheses, must be known. How...

متن کامل

Optimum Local Decision Rules in a Distributed Detection System with Dependent Observations

The theory of distributed detection is receiving a lot of attention. A common assumption used in previous studies is the conditional independence of the observations. In this paper, the optimization of local decision rules for distributed detection networks with correlated observations is considered. We focus on presenting the detection theory for parallel distributed detection networks with fi...

متن کامل

Optimum Local Decision Rules in a Distributed Detection System with Dependent Observations

The theory of distributed detection is receiving a lot of attention. A common assumption used in previous studies is the conditional independence of the observations. In this paper, the optimization of local decision rules for distributed detection networks with correlated observations is considered. We focus on presenting the detection theory for parallel distributed detection networks with fi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1993